Strictly quasi-convex (concave) functions and duality in mathematical programming
نویسندگان
چکیده
منابع مشابه
Duality between quasi-concave functions and monotone linkage functions
A function F defined on all subsets of a finite ground set E is quasiconcave if F (X∪Y ) ≥ min{F (X), F (Y )} for all X, Y ⊂ E. Quasi-concave functions arise in many fields of mathematics and computer science such as social choice, theory of graph, data mining, clustering and other fields. The maximization of quasi-concave function takes, in general, exponential time. However, if a quasi-concav...
متن کاملQuasi-concave Programming Quasi-concave Programming
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملDuality and Convex Programming
This chapter surveys key concepts in convex duality theory and their application to the analysis and numerical solution of problem archetypes in imaging.
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملQuasi-concave functions on antimatroids
In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids defined as languages. An algorthmic characterization of antimatroids, that considers them as set systems, was given in [4]. This characterization is based on the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1967
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90095-9